Paperfolding Sequences, Paperfolding Curves and Local Isomorphism
نویسنده
چکیده
For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding curves as the curves without endpoint which are unions of increasing sequences of n-folding curves for n integer. We prove that there exists a standard way to extend any complete folding curve into a covering of R by disjoint such curves, which satisfies the local isomorphism property introduced to investigate aperiodic tiling systems. This covering contains at most six curves. 2000 Mathematics Subject Classification. Primary 05B45; Secondary 52C20, 52C23.
منابع مشابه
an 2 01 1 Paperfolding morphisms , planefilling curves , and fractal tiles
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and planefilling properties of these curves, giving simple geometric criteria for a complete classification. Finally, we show how the automatic structure of the seq...
متن کاملOptimal Description of Automatic Paperfolding Sequences
The class of 2-automatic paperfolding sequences corresponds to the class of ultimately periodic sequences of unfolding instructions. We rst show that a paper-folding sequence is automatic ii it is 2-automatic. Then we provide families of minimal nite-state automata, minimal uniform tag sequences and minimal substitutions describing automatic paperfolding sequences, as well as a family of algebr...
متن کاملPaperfolding and Catalan numbers
1 : This paper reproves a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2. The guiding principle can be described by: Paperfolding = Catalan modulo 2 + signs given by 2−automatic sequences.
متن کاملThe abelian complexity of the paperfolding word
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
متن کاملMirroring and interleaving in the paperfolding sequence
Three equivalent methods of generating the paperfolding sequence are presented as well as a categorisation of runs of identical terms. We find all repeated subsequences, the largest repeated subsequences and the spacing of singles, doubles and triples throughout the sequence. The paperfolding sequence is shown to have links to the Binary Reflected Gray Code and the Stern-Brocot tree. Discipline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010